Constant time parallel computations in λ-calculus

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The λ-calculus in the π-calculus

Mathematical Structures in Computer Science / Volume 21 / Issue 05 / October 2011, pp 943 996 DOI: 10.1017/S0960129511000260, Published online: 19 May 2011 Link to this article: http://journals.cambridge.org/abstract_S0960129511000260 How to cite this article: XIAOJUAN CAI and YUXI FU (2011). The λ-calculus in the π-calculus. Mathematical Structures in Computer Science, 21, pp 943-996 doi:10.10...

متن کامل

Trust in the λ-calculus

This paper introduces trust analysis for higher-order languages. Trust analysis encourages the programmer to make explicit the trustworthiness of data, and in return it can guarantee that no mistakes with respect to trust will be made at run-time. We present a confluent λ-calculus with explicit trust operations, and we equip it with a trust-type system which has the subject reduction property. ...

متن کامل

The structural λ-calculus

Inspired by a recent graphical formalism for λ-calculus based on Linear Logic technology, we introduce an untyped structural λ-calculus, called λj, which combines action at a distance with exponential rules decomposing the substitution by means of weakening, contraction and dereliction. Firstly, we prove fundamental properties such as confluence and preservation of β-strong normalisation. Secon...

متن کامل

Intersection Typed λ - calculus

The aim of this paper is to discuss the design of an explicitly typed λ-calculus corresponding to the Intersection Type Assignment System (IT ), which assigns intersection types to the untyped λ-calculus. Two different proposals are given. The logical foundation of all of them is the Intersection Logic IL.

متن کامل

Linear-algebraic Λ-calculus

With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an interpreter/simulator) is provided for this language in the form of a term rewrite system. The linear-algebraic λ-calculus hereby constructed is linear in a different...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2001

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(00)00380-7